Hierarchical Learning of Conjunctive Concepts in Spiking Neural Networks

نویسندگان

  • Cengiz Günay
  • Anthony S. Maida
  • Vijay V. Raghavan
  • William R. Edwards
چکیده

The temporal correlation hypothesis proposes that synchronous activity in different regions ofthe brain describes integral entities (von der Malsburg, 1981; Singer and Gray, 1995). Thistemporal binding approach is a possible solution to the longstanding binding problem ofrepresenting composite objects (Rosenblatt, 1961). To complement the dynamic nature oftemporal binding, a recruitment learning method has been proposed for providing long-termstorage (Feldman, 1982; Valiant, 1994). We improve the recruitment method to use a morebiologically realistic and computationally powerful spiking neuron model.However, using continuous-time spiking neurons and brain-like connectivity assumptionsposes new problems in hierarchical recruitment. First, we propose timing parameterconstraints for recruitment over asymmetrically connected delay lines. We verify theseconstraints using simulations. These constraints are useful for both building abstract networksand providing insight into bio-mechanisms that ensure signal integrity in the brain. As asecond problem, we calculate the required feedforward excitatory and lateral inhibitoryconnection densities for stable propagation of activity in hierarchical structures of thenetwork. We give analytic solutions using a stochastic population model of a simplifiedlayered network. Our approach is independent of the network size, but depends on lateralinhibition and noisy feedforward delays.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reinforcement Learning in Neural Networks: A Survey

In recent years, researches on reinforcement learning (RL) have focused on bridging the gap between adaptive optimal control and bio-inspired learning techniques. Neural network reinforcement learning (NNRL) is among the most popular algorithms in the RL framework. The advantage of using neural networks enables the RL to search for optimal policies more efficiently in several real-life applicat...

متن کامل

Reinforcement Learning in Neural Networks: A Survey

In recent years, researches on reinforcement learning (RL) have focused on bridging the gap between adaptive optimal control and bio-inspired learning techniques. Neural network reinforcement learning (NNRL) is among the most popular algorithms in the RL framework. The advantage of using neural networks enables the RL to search for optimal policies more efficiently in several real-life applicat...

متن کامل

Spiking Neurons by Sparse Temporal Coding and Multilayer Rbf Networks

We demonstrate that spiking neural networks encoding information in the timing of single spikes are capable of computing and learning clusters from realistic data. We show how a spiking neural network based on spike-time coding and Hebbian learning can successfully perform unsupervised clustering on real-world data, and we demonstrate how temporal synchrony in a multi-layer network can induce h...

متن کامل

Unsupervised clustering with spiking neurons by sparse temporal coding and multilayer RBF networks

We demonstrate that spiking neural networks encoding information in the timing of single spikes are capable of computing and learning clusters from realistic data. We show how a spiking neural network based on spike-time coding and Hebbian learning can successfully perform unsupervised clustering on real-world data, and we demonstrate how temporal synchrony in a multilayer network can induce hi...

متن کامل

Unsupervised Classification of Complex Clusters in Networks of Spiking Neurons

For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with an efficient use of neurons. Input variables are encoded independently in a population code by neurons with 1-dimensional graded and overlapping sensitivity profiles. Using a temporal Hebbian learning rule, the network ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003